A New Globally Convergent of Spectral Hideaki - Yasushi Type Conjugate Gradient Method
نویسندگان
چکیده
منابع مشابه
Globally convergent modified Perry's conjugate gradient method
Conjugate gradient methods are probably the most famous iterative methods for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. In this paper, we propose a new conjugate gradient method which is based on the MBFGS secant condition by modifying Perry’s method. Our proposed met...
متن کاملA globally convergent version of the Polak-Ribière conjugate gradient method
1 ABSTRACT In this paper we propose a new line search algorithm that ensures global convergence of the Polak-Ribi ere conjugate gradient method for the unconstrained minimization of nonconvex diierentiable functions. In particular, we show that every limit point produced by the Polak-Ribi ere iteration is a stationary point of the objective function. Moreover, we prove that, asymptotically, the...
متن کاملA Globally Convergent Conjugate Gradient Method for Minimizing Self-Concordant Functions on Riemannian Manifolds
Self-concordant functions are a special class of convex functions in Euclidean space introduced by Nesterov. They are used in interior point methods, based on Newton iterations, where they play an important role in solving efficiently certain constrained optimization problems. The concept of self-concordant functions has been defined on Riemannian manifolds by Jiang et al. and a damped Newton m...
متن کاملA Globally Convergent Hybrid Conjugate Gradient Method and Its Numerical Behaviors
→ R n is continuous.Throughout this paper, this problem corresponds to optimality condition of a certain problem of minimizing f : Rn → R which may be not easy to calculate or cannot be expressed as elementary functions. When the dimension n is large, conjugate gradient methods can be efficient to solve problem (1). For any given starting point x 0 ∈ R , a sequence {x k } is generated by the fo...
متن کاملA Globally Convergent Modified Conjugate-gradient Line-search Algorithm with Inertia Controlling
In this paper we have addressed the problem of unboundedness in the search direction when the Hessian is indefinite or near singular. A new algorithm has been proposed which naturally handles singular Hessian matrices, and is theoretically equivalent to the trust-region approach. This is accomplished by performing explicit matrix modifications adaptively that mimic the implicit modifications us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF EDUCATION AND SCIENCE
سال: 2018
ISSN: 2664-2530
DOI: 10.33899/edusj.2018.159312